Multigranulation Supertrust Model for Attribute Reduction
نویسندگان
چکیده
As big data often contains a significant amount of uncertain, unstructured, and imprecise that are structurally complex incomplete, traditional attribute reduction methods less effective when applied to large-scale incomplete information systems extract knowledge. Multigranular computing provides powerful tool for use in analysis conducted at different levels granularity. In this article, we present novel multigranulation supertrust fuzzy-rough set-based (MSFAR) algorithm support the formation hierarchies granules higher types orders, which addresses newly emerging mining problems analysis. First, model based on valued tolerance relation is constructed identify fuzzy similarity changing knowledge granularity with multimodality attributes. Second, an ensemble consensus compensatory scheme was adopted calculate multigranular trust degree reputation granularities create reasonable subproblems granulation levels. Third, equilibrium method coevolution employed ensure wide range balancing exploration exploitation, strategy can classify super elitists' preferences detect noncooperative behaviors global convergence ability high search accuracy. The experimental results demonstrate MSFAR achieves performance addressing uncertain large number multigranularity variables.
منابع مشابه
Parallel Island Model for Attribute Reduction
We develop a framework for parallel computation of the optimal rough set decision reducts from data. We adapt the island model for evolutionary computing. The idea is to optimize reducts within separate populations (islands) and enable the best reducts-chromosomes to migrate among islands. Experiments show that the proposed method speeds up calculations and also provides often better quality of...
متن کاملMinimal Attribute Space Bias for Attribute Reduction
Attribute reduction is an important inductive learning issue addressed by the Rough Sets society. Most existing works on this issue use the minimal attribute bias, i.e., searching for reducts with the minimal number of attributes. But this bias does not work well for datasets where different attributes have different sizes of domains. In this paper, we propose a more reasonable strategy called ...
متن کاملConsistency Based Attribute Reduction
Rough sets are widely used in feature subset selection and attribute reduction. In most of the existing algorithms, the dependency function is employed to evaluate the quality of a feature subset. The disadvantages of using dependency are discussed in this paper. And the problem of forward greedy search algorithm based on dependency is presented. We introduce the consistency measure to deal wit...
متن کاملAttribute Reduction in Variable Precision Rough Set Model
The differences of attribute reduction and attribute core between Pawlak’s rough set model (RSM) and variable precision rough set model (VPRSM) are analyzed in detail. According to the interval properties of precision parameter b with respect to the quality of classification, the definition of attribute reduction is extended from a specific b value to a specific b interval in order to overcome ...
متن کاملAttribute reduction of covering decision systems by hypergraph model
Attribute reduction (also called feature subset selection) plays an important role in rough set theory. Different from the classical attribute reduction algorithms, the methods of attribute reduction based on covering rough sets appear to be suitable for numerical data. However, it is time-consuming in dealing with the large-scale data. In this paper, we study the problem of attribute reduction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Fuzzy Systems
سال: 2021
ISSN: ['1063-6706', '1941-0034']
DOI: https://doi.org/10.1109/tfuzz.2020.2975152